63B - Settlers' Training - CodeForces Solution


implementation *1200

Please click on ads to support us..

Python Code:

n , k = map(int ,input().split())
m = list(map(int ,input().split()))
counter = 0 
while sum(m) < k*n:
    visted = [0] * (k + 1)
    for i in range(n) : 
        if visted[m[i]] == 0 and m[i] < k:
            visted[m[i]] = 1
            m[i] += 1
    counter += 1
print(counter)     
            


Comments

Submit
0 Comments
More Questions

838A - Binary Blocks
1515D - Phoenix and Socks
1624D - Palindromes Coloring
1552F - Telepanting
1692G - 2Sort
1191A - Tokitsukaze and Enhancement
903A - Hungry Student Problem
52B - Right Triangles
1712A - Wonderful Permutation
1712D - Empty Graph
1712B - Woeful Permutation
1712C - Sort Zero
1028B - Unnatural Conditions
735B - Urbanization
746C - Tram
1278B - A and B
1353D - Constructing the Array
1269C - Long Beautiful Integer
1076A - Minimizing the String
913C - Party Lemonade
1313A - Fast Food Restaurant
681A - A Good Contest
1585F - Non-equal Neighbours
747A - Display Size
285A - Slightly Decreasing Permutations
515C - Drazil and Factorial
1151E - Number of Components
1151F - Sonya and Informatics
556A - Case of the Zeros and Ones
867A - Between the Offices